System and method for service provider search

ABSTRACT

A system and method are disclosed for the creation of future time based search. Service providers identify their availability. This information is then searchable by potential clients to determine if relevant, local service providers are available to perform needed service.

FIELD OF THE INVENTION

The present invention is directed generally to apparatuses, methods, andsystems for time based services searching. In particular, the inventionpertains to the performance of internet searches to identify serviceproviders who are available at certain future times.

BACKGROUND OF THE INVENTION

The Internet provides a number of recourses for identifying serviceproviders, e.g., white pages listing or general internet searches. Theseservices generally provide a mechanism to search for or browse relevantservice providers, including limiting the search to your local area. Forexample, Google's “local.google.com” service allows a searcher to enterkeywords and a location to find relevant services in a particular area.Services such as these are limited, however, in that once the provideris identified the user must contact each provider individually todetermine if the service provider will be appropriate for the particularservice required.

SUMMARY OF THE INVENTION

This disclosure details the implementation of apparatuses, methods, andsystems for service provider identification searching. The disclosedsystems, methods, and apparatuses provide mechanisms to allow users ofthe system to search for relevant service providers based on a number ofcriteria including keywords, service type, location, futureavailability, hourly rate, and skill levels. This fine grained approachfor service reporting and identification increases a user's efficiencyin conducting service searches.

Systems, methods, and apparatuses are disclosed for identifying serviceproviders available at a future time. This is accomplished by receivinga service provider's name, service provided, physical location, rate,and availability information from the provider's web site or anothersource. This information is associated together and stored in asearchable database. With the database populated with similarinformation from a number of service providers, a search interface isprovided. Through the search interface, potential clients submitrequests for service provider identification that satisfy theirrequested future availability (including, routine availability), servicetype, and location criteria. Any matching results are communicated tothe potential clients.

In a further embodiment, future availability information relating to oneor more service providers is gathered and stored with associated serviceprovider information describing characteristics of each serviceprovider. In response to a search request, service providers matching afuture time availability and at least one additional service providercharacteristic are identified. The service providers matching therequest are output.

In a further embodiment, future time availability browsing is provided.Information about the future time availability of service providers isgathered, stored, and associated with other information about theprovider. User interface elements are provided for selecting a futuretime and a service provider characteristic. These interface elementsgenerate an input upon which a search is conducted of the stored futureavailability and associated service provider characteristics. Anymatches to the input are output for review.

In a further embodiment, the future availability of traveling providers,staff, or employees is tracked and used to update the service provider'soverall availability. Traveling providers, staff, or employees provideinformation including their current location. This information alongwith the provider's availability is used to generate location specificfuture availability information. In this way, the availabilityinformation, or a staff calendar, can be more efficiently provided byshowing earlier availability in locations near the provider and lateravailability for more distant locations, which require a longer traveltime.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings illustrate various non-limiting, inventiveaspects in accordance with the present disclosure:

FIG. 1 illustrates an overview of one embodiment of the disclosedsystem.

FIG. 2 illustrates an overview of another embodiment of the disclosedsystem.

FIG. 3 illustrates an embodiment of a search interface in accordancewith the disclosed system.

FIG. 4 illustrates an embodiment of a browse interface in accordancewith the disclosed system.

FIG. 5 illustrates an embodiment of a service employee location updaterin accordance with the disclosed system.

FIG. 6 illustrates a systemization diagram for an embodiment of thedisclosed system.

DETAILED DESCRIPTION

In the following description of the various embodiments, reference ismade to the accompanying drawings, which show by way of illustrationvarious exemplary embodiments that practice the disclosed invention. Itis to be understood that other embodiments may be utilized andstructural and functional modifications may be made without departingfrom the scope of the present invention.

A representative problem that can be solved by employing the teachingsof the disclosed invention is the search for a service provider to workin one's home, such as, for example, a plumber. In such a situation theindividual requiring service will typically search their yellow pages,ask acquaintances for referrals, or search on the Internet. While eachof these solutions might identify relevant providers, the personperforming the search must still contact each of the providersidentified and determine which are available at a time convenient forthe searcher, whether the provider's rate is acceptable, and/or whetherthe provider has the appropriate skill or work quality requirements.This problem is particularly pronounced when searching electronicsources, such as the Internet, because the search will typically uncovernumerous potential providers. Contacting each of the providersidentified in the search and determining whether they are appropriateand available at the required time could become tedious.

The effort required to identify relevant and available service providersis greatly reduced by providing systems and methods for the serviceproviders to identify the times at which they are available and allowtheir clientele to search based on those times. The systems and methodsare particularly useful when they are standardized such that thesearching can be done via a service aggregator site or general internetsearch engine, such as Google, Yahoo!, or AltaVista. For example, asshown in FIG. 1, an arbitrary number of service providers 101 a-101 nprovide information about themselves via the Internet 110. Thisinformation could be, for example, a web page. The client 120 alsoconnects to the Internet 110 and can, thereby, receive information fromand optionally communicate with one or more of the service providers 101a-101 n.

Using the structure shown in FIG. 1, service providers 101 a-101 n maycreate and provide Internet accessible information, such as web pages,providing information about their business, including the work theyperform, their location, etc. Adding availability information, however,raises a number of issues. For example, a standardized method forrepresenting availability should be adopted to enable efficientsearching by potential clients. Otherwise, each service provider mightcreate its own ad hoc system for representing its availability andclients would be unlikely to learn about and make use of the varioussystems. Adoption of a standard representation of future timeavailability, including, ranges of time, would allow the most widespreaduse of the system by potential clients. With a representation of futuretime availability established, potential clients will be able to formattheir searches to conform to the representation.

One basic approach for establishing a representation of future timeavailability would be to develop a common format for time representationto be used by service providers on their web pages or other informationsources, such as, for example, internal databases or systems. Forexample, service providers could simply provide their availability as aspace delimited plain text list in a convenient standardized format,such as for example, month/day/year/start_time-end_time. Note thatprecise format of the time identifier is not important and particularfields, such as year or end_time, could be expanded, excluded, ormodified. Alternatively, the time identifier may include an end_timefield indicating when the work must be finished without including astart_time. The availability information could, alternatively, beprovided in more generic terms, such as morning, afternoon, or evening.The plain text time identifier information could simply be added,visibly or invisibly, to provider's existing on-line information.Potential clients could then include a corresponding string in theirsearches to locate available service providers because search siteswould pick up and record the availability information just as they wouldany text information.

For example, a client living in Hometown, N.Y. seeking a local plumberwho will be available to start on Jun. 10, 2006 between 9:00 and 10:00a.m., could enter a search for: plumber Hometown Jun. 10,2006/9:00-10:00. Plumbers in the area who have websites, or who have anetwork presence via some other service, would include their typicalinformation—e.g. the fact that they provide plumbing services, wherethey are located, their telephone number, etc.—and a group of timeavailabilities in visible or invisible text. The benefit of invisibletext is that it will be read by search engines without marring the lookand design of the site. The information provided on the plumbers'websites would be cataloged by a search provider. The client's searchwould discover any plumbing service in, or around, Hometown that hasidentified itself as being available at the indicated time.

This approach has the advantage of requiring no additionalinfrastructure from search providers. As far as the search engines areconcerned, the code “Jun. 10, 2006/9:00-10:00” is simply a string ofinformation like any other word or number stored in its database.Accordingly, such a system could be established without any cooperationby search providers. The only requirement for its implementation isnotifying service providers and clients of the proper format for listingand searching the date-based information. With that information, serviceproviders can add information complying with the system to their sitesand clients can search for information by conforming to that format.

One limitation of this approach is that the technique is somewhat rigidand would require the service provider and the client to exactly matchtheir respective availability times and searches. For example, if theplumber in the previous example had recorded his availability as “Jun.10, 2006/8:30-10:30” the potential client's search would not haveuncovered this provider because there was not an identical match. Thisis true regardless of the fact that the plumber was clearly availableduring the period requested. Accordingly, a system in which the serviceprovider's availability could be expressly identified as timeinformation would allow more efficient identification of timeavailability and allow a more robust level of searching. Accordingly,the plain text searching just described would be most suitable forservices that schedule their service in uniform time blocks. Barbers,for example, may benefit from such a system where they scheduleappointments in uniform half-hour blocks.

FIG. 2 provides a schematic overview of participants in an embodiment ofthe disclosed system that allows more control in the identification andsearching of service providers' future availability. Like the FIG. 1embodiment, an arbitrary number of service providers 101 a-101 n provideinformation about themselves via the Internet 110 and potential clients120 search for appropriate service providers. The FIG. 2 embodiment addsa search host 130 that participates somewhat more actively in the searchprocess.

Specifically, in the FIG. 2 embodiment the service providers indicatetheir availability in a manner that makes the availability timequantities machine readable. In other words, the computers at the searchhost 130 can parse the service providers' information and store theiravailability as a time quantity, rather than a generic text string. Thishas the advantage of preventing the service provider from having tobreak up its time into discrete blocks when it identifies itsavailability. Accordingly, if a particular service provider is availableall day it could list its availability as 8:00-18:00, even when theprovider intends to perform a number of service calls that day. Forexample, if a potential client performed a search requestingavailability from 9:00-9:45. Algorithms implemented by the search hostwould recognize that the provider's availability of 8:00-18:00, includesthe 9:00-9:45 slot requested by the searching client.

The search host 130 could be operated by an existing internet searchprovider, an independent service provider search service, or a servicethat allows potential clients to browse service providers by servicetype and time. The search host 130 can be embodied, for example, with aweb server accessible by potential client and containing a databasedetailing information, such as future availability and location, aboutvarious service providers.

As shown in FIG. 2, the search host 130 will be able to communicate withservice providers 101 a-101 n to obtain information via the Internet 110about the services they perform, their location, their rates, theirskill level, and their availability. A potential client 120 cancommunicate with the search host 130 via the Internet 110, for examplevia a web interface, although any appropriate mechanism can be used.After receiving a query from a client, the search host can returndetails to the client regarding service providers matching the query.The client can then use the information returned by the search host 130to contact the service provider 101.

In order for the search host to populate its database with theavailability times for the service providers, a machine readablerepresentation of the providers' availability must be provided. Thiscould be accomplished by implementing text parsing and readingalgorithms at the search host, which would interpret un-coded text onthe service providers' sites.

Another approach would be for the service providers to code the timeentries in a directly machine readable format. The search host couldthen communicate the service provider's system to retrieve the relevantinformation. One embodiment for accomplishing this would be to code timeavailability via XML with an appropriately defined schema. An exemplaryXML encoding for “time availability” is provided below:<TimeAvailability> <StartTime> <month> 12 </month> <day> 20 </day><year> 2006 </year> <hour> 13 </hour> <minute> 00 </minute> </StartTime><EndTime> <month> 12 </month> <day> 20 </day> <year> 2006 </year> <hour>18 </hour> <minute> 00 </minute> </EndTime> </TimeAvailability>

As shown above, this XML represents an availability on Dec. 20, 2006 at1:00 p.m. through 6:00 p.m. Tags could also be provided to label timesets more loosely, such as morning, afternoon, evening, or everyTuesday, etc. Alternatively, machine readable coding schemes other thanXML could be used. For example, the same information could be coded inJavaScript Object Notation (JSON) or any other suitable scheme. Inaddition, other information could be added to the availabilityinformation. Times could be labeled as available based on additionalcriteria. For example, a service provider might label a particular timea “maybe” available, “emergency” available, or “increased rate”available. In this way a service provider could indicate possibleavailability, or willingness to change its plans for a higher fee.Identifiers could also be added to indicate the level of security orprivacy the service provider would like applied to the availabilityinformation. In one scenario, a tag might be added to indicate that theprovider wants the date available for searching purposes, but not forviewing purposes. In this way, the service provider can show hisavailability without publicizing his working schedule.

The coded availability information would be added to the serviceprovider's site, which in turn can be retrieved and stored by the searchhost to create the search host's database of service providers.Typically, the search host can periodically “crawl” the sites that itmaintains in its database and record the relevant information.“Crawling” is the approach used by large search providers like Google tocreate their search database. In this way, the search host would notonly record the typical search information, such as the website'skeywords and location, but it would also record the service providers'future availability.

One potential issue with providing a service providers' futureavailability, is updating the information stored by the search host. Forexample, as a service provider's schedule fills up, availability timesposted on its site will need to shorten. If, however, the search hosthas not been informed of the change the search host 130 will misreportthe service provider's availability to clients. The extent of thisinformation gap depends on how frequently the search host “crawls” theservice providers' web sites. For sites that are heavily trafficked andfrequently updated the search host would have to check for updatesrelatively frequently.

The updating problem can be solved by providing a mechanism for theservice providers to update the search host of any change to theirposted availability. This functionality can be implemented in a numberof different ways. One approach would be for the service provider 101 topublish its availability using an RSS feed. RSS is a technology thatprovides an efficient mechanism for a content provider to notify itsusers of content updates. A search host 130 could subscribe to theservice providers' availability RSS feeds and be informed of any changesto the service providers' availability. This will provide rapid updatingof the search host's 130 availability database and ensure accurateresults. In the alternative, a true push technology could be employed todirectly update the search host with any changed information.

In other embodiments the service providers 101 might provide theiravailability information through a private link with the search host130. In such an embodiment, one or more of the providers 101 wouldcommunicate directly with the search host 130 to exchange informationabout the providers' availability. This communication could occur viaany known means, e.g., VPN, FTP, telephone, intranet, web connectionwith secure login, etc. The individual service providers may also log indirectly to the search host to identify their availability.

FIG. 3 provides an example of an interface that search host 130 couldcreate to implement the client side portion of the disclosed system by,for example, implementing these features in a web page. Text box 305provides a place for the client to enter the type of service the clientrequires. Text box 315 provides a place for the client to enter therequired location.

Start time entry 335 provides a place for the client to enter thestarting time at which they would like the service to be performed. Endtime entry 345 provides a place for the client to enter the time atwhich the service may end, if necessary. Alternately, the system couldaccept just an end time entry without specifying the start time. Thestart and end times could also represent the time window in which theclient needs the service provider to begin, rather than the time inwhich the service must begin and be completed. Or time could bedisplayed in pre-set intervals as available or unavailable. The userinterface for the start and end times could also be implemented with acalendar-like interface for choosing days and/or a menu interface forchoosing time. The time can also be stated more generically, such asevery Thursday, Friday morning, all day Wednesday, etc.

Text box 325 can be used to record other criteria the client mayrequire, such as cost, expertise, certifications, rating levels, etc.The data fields collected in the FIG. 3 interface are merely exemplary.Other information could optionally be collected and various elements inFIG. 3 could be excluded. In addition, the interface elements shown arealso merely exemplary. Other suitable interface elements known in theart could alternatively be employed, such as a calendar interface toindicate dates, a pull down menu or map to indicate locations, etc.

The search host might also provide information about the availableservice providers with a browsing paradigm rather than search paradigm.An example of a browsing interface is shown in FIG. 4. In the FIG. 4browsing example, the client would first be presented with a choice oflocation 410. Once a location has been input, the client would bepresented with a choice of service types available for that location420. With the service type selected, the select time interface would beprovided 430. Once a requested time is entered, such as, for example,morning, afternoon, or evening, a browse results page 440 is providedand the client can review, examine, and/or contact available serviceproviders. As with the search paradigm, various elements of the browsinginterface example disclosed in FIG. 4 could be added to rearranged ordeleted.

A further refinement of the system could allow service providers thattravel over relatively long distances when servicing a particulargeographical area to associate a particular availability time with aparticular location. In this way, a service provider can efficientlynotify potential clients that it will be available to perform service ina particular area. For example, if the service provider is going to bein Neartown in the early morning, it can associate its mid and latemorning time slots with the Neartown location and perhaps fill thoseslots with other work in or near Neartown. Without such efficiencies,the service provider might have needed to identify itself as unavailablefor a longer period of time to ensure it had enough travel time to reachits entire service area.

For example, if a handyman is working from 8:00 a.m. to 8:45 a.m. inNeartown he might identify himself as available at 9:00 a.m. for otherwork in Neartown, but unavailable in Fartown. If travel time fromFartown to Neartown takes one hour, the handyman's availability inFartown will not begin until 10:00 a.m. In this way, if a client inNeartown needs work at 9:00 a.m. they can identify the provider who isin the area. Similarly, the service provider benefits from a moreefficient use of its resources. This might also provide a situationwhere it would be advantageous to identify availability times moreloosely, such as available in Fartown at about 10:00 a.m. or maybe 10:00a.m. to account for variability in traffic, etc.

The tying together of the provider's location and schedule would alsoenable searches where the location is the primary criteria and the timeis non-limiting. For example, certain specialized and/or maintenanceoriented service providers might provide a means to search for the nexttime they will be in your area. In that way, a searcher might requestservice the next time the service provider, e.g., a gutter cleaner,driveway sealer, window cleaner, etc., is in her area.

FIG. 5 shows an exemplary embodiment that enables a service provider totrack various service personnel and use that information to update theservice provider's website with availability and location information.Specifically, service providers 530 a-c, such as providers, staff, oremployees of the service provider travel to perform their service forclients. While on duty, the service providers periodically notify areceiver 515 of their whereabouts. For example, at each job the serviceemployee might send a message to the receiver indicating where theemployee is along with an estimation of the amount of time the employeeexpects to remain at the particular job. The receiver 515 can use thisinformation to update the service provider's availability posted on theprovider's web site 505. The receiver 515 can be embodied by a personthat receives information from the service providers and makes inputs tothe system. In the alternative, the receiver 515 could be automated,such that it receives updated location information from the serviceproviders electronically. For example, the service providers could sendthe receiver a signal via a electronic communications deviceincorporated with a positioning device, such as GPS. In a furtheralternative, the receiver could directly copy the relevant informationfrom the service providers' personal digital assistants (PDA), laptopcomputers, cell phones, or any other analogous device.

FIG. 6 of the present disclosure illustrates inventive aspects of a timebased search host 601 in a block diagram. In this embodiment, the timebased search host 601 may serve to retrieve, store, search, serve,identify, instruct, generate, match, and/or update databases containingrelevant service provider availability information and/or other relateddata. It should be noted that the client's device and the serviceprovider may be comprised in a device similar to time based search host601.

Typically, users, which may be people and/or other systems, engageinformation technology systems (e.g., commonly computers) to facilitateinformation processing. In turn, computers employ processors to processinformation; such processors are often referred to as central processingunits (CPU). A common form of processor is referred to as amicroprocessor. A computer operating system, which, typically, issoftware executed by CPU on a computer, enables and facilitates users toaccess and operate computer information technology and resources. Commonresources employed in information technology systems include: input andoutput mechanisms through which data may pass into and out of acomputer; memory storage into which data may be saved; and processors bywhich information may be processed. Often information technology systemsare used to collect data for later retrieval, analysis, andmanipulation, commonly, which is facilitated through database software.Information technology systems provide interfaces that allow users toaccess and operate various system components.

In one embodiment, the time based search host 601 may be connected toand/or communicate with entities such as, but not limited to: one ormore users from user input devices 611; peripheral devices 612; acryptographic processor device 628; and/or a communications network 613.

Networks are commonly thought to comprise the interconnection andinteroperation of clients, servers, and intermediary nodes in a graphtopology. It should be noted that the term “server” as used throughoutthis disclosure refers generally to a computer, other device, software,or combination thereof that processes and responds to the requests ofremote users across a communications network. Servers serve theirinformation to requesting “clients.” The term “client” as used hereinrefers generally to a computer, other device, software, or combinationthereof that is capable of processing and making requests and obtainingand processing any responses from servers across a communicationsnetwork. A computer, other device, software, or combination thereof thatfacilitates, processes information and requests, and/or furthers thepassage of information from a source user to a destination user iscommonly referred to as a “node.” Networks are generally thought tofacilitate the transfer of information from source points todestinations. A node specifically tasked with furthering the passage ofinformation from a source to a destination is commonly called a“router.” There are many forms of networks such as Local Area Networks(LANs), Pico networks, Wide Area Networks (WANs), Wireless Networks(WLANs), etc. For example, the Internet is generally accepted as beingan interconnection of a multitude of networks whereby remote clients andservers may access and interoperate with one another.

A time based search host 601 may be based on common computer systemsthat may comprise, but are not limited to, components such as: acomputer systemization 602 connected to memory 629.

Computer Systemization

A computer systemization 602 may comprise a clock 630, centralprocessing unit (CPU) 603, a read only memory (ROM) 606, a random accessmemory (RAM) 605, and/or an interface bus 607, and most frequently,although not necessarily, are all interconnected and/or communicatingthrough a system bus 604. Optionally, the computer systemization may beconnected to an internal power source 686. Optionally, a cryptographicprocessor 626 may be connected to the system bus. The system clocktypically has a crystal oscillator and provides a base signal. The clockis typically coupled to the system bus and various clock multipliersthat will increase or decrease the base operating frequency for othercomponents interconnected in the computer systemization. The clock andvarious components in a computer systemization drive signals embodyinginformation throughout the system. Such transmission and reception ofsignals embodying information throughout a computer systemization may becommonly referred to as communications. These communicative signals mayfurther be transmitted, received, and the cause of return and/or replysignal communications beyond the instant computer systemization to:communications networks, input devices, other computer systemizations,peripheral devices, and/or the like. Of course, any of the abovecomponents may be connected directly to one another, connected to theCPU, and/or organized in numerous variations employed as exemplified byvarious computer systems.

The CPU comprises at least one high-speed data processor adequate toexecute program modules for executing user and/or system-generatedrequests. The CPU may be a microprocessor such as AMD's Athlon, Duronand/or Opteron; IBM and/or Motorola's PowerPC; Intel's Celeron, Itanium,Pentium, Xeon, and/or XScale; and/or the like processor(s). The CPUinteracts with memory through signal passing through conductive conduitsto execute stored program code according to conventional data processingtechniques. Such signal passing facilitates communication within thetime based search host controller and beyond through various interfaces.Should processing requirements dictate a greater amount speed, parallel,mainframe and/or super-computer architectures may similarly be employed.Alternatively, should deployment requirements dictate greaterportability, smaller Personal Digital Assistants (PDAs) may be employed.

Power Source

The power source 686 may be of any standard form for powering smallelectronic circuit board devices such as the following power cells:alkaline, lithium hydride, lithium ion, nickel cadmium, solar cells,and/or the like. Other types of AC or DC power sources may be used aswell. In the case of solar cells, in one embodiment, the case providesan aperture through which the solar cell may capture photonic energy.The power cell 686 is connected to at least one of the interconnectedsubsequent components of the time based search host thereby providing anelectric current to all subsequent components. In one example, the powersource 686 is connected to the system bus component 604. In analternative embodiment, an outside power source 686 is provided througha connection across the I/O 608 interface. For example, a USB and/orIEEE 1394 connection carries both data and power across the connectionand is therefore a suitable source of power.

Interface Adapters

Interface bus(ses) 607 may accept, connect, and/or communicate to anumber of interface adapters, conventionally although not necessarily inthe form of adapter cards, such as but not limited to: input outputinterfaces (I/O) 608, storage interfaces 609, network interfaces 610,and/or the like. Optionally, cryptographic processor interfaces 627similarly may be connected to the interface bus. The interface busprovides for the communications of interface adapters with one anotheras well as with other components of the computer systemization.Interface adapters are adapted for a compatible interface bus. Interfaceadapters conventionally connect to the interface bus via a slotarchitecture. Conventional slot architectures may be employed, such as,but not limited to: Accelerated Graphics Port (AGP), Card Bus,(Extended) Industry Standard Architecture ((E)ISA), Micro ChannelArchitecture (MCA), NuBus, Peripheral Component Interconnect (Extended)(PCI(X)), PCI Express, Personal Computer Memory Card InternationalAssociation (PCMCIA), and/or the like.

Storage interfaces 609 may accept, communicate, and/or connect to anumber of storage devices such as, but not limited to: storage devices614, removable disc devices, and/or the like. Storage interfaces mayemploy connection protocols such as, but not limited to: (Ultra)(Serial) Advanced Technology Attachment (Packet Interface) ((Ultra)(Serial) ATA(PI)), (Enhanced) Integrated Drive Electronics ((E)IDE),Institute of Electrical and Electronics Engineers (IEEE) 1394, fiberchannel, Small Computer Systems Interface (SCSI), Universal Serial Bus(USB), and/or the like.

Network interfaces 610 may accept, communicate, and/or connect to acommunications network 613. Through a communications network 613, thetime based search host 601 is accessible through remote clients 633 b(e.g., computers with web browsers) by users 633. Network interfaces mayemploy connection protocols such as, but not limited to: direct connect,Ethernet (thick, thin, twisted pair 10/100/1000 Base T, and/or thelike), Token Ring, wireless connection such as IEEE 802.11a-x, and/orthe like. A communications network may be any one and/or the combinationof the following: a direct interconnection; the Internet; a Local AreaNetwork (LAN); a Metropolitan Area Network (MAN); an Operating Missionsas Nodes on the Internet (OMNI); a secured custom connection; a WideArea Network (WAN); a wireless network (e.g., employing protocols suchas, but not limited to a Wireless Application Protocol (WAP), I-mode,and/or the like); and/or the like. A network interface may be regardedas a specialized form of an input output interface. Further, multiplenetwork interfaces 610 may be used to engage with various communicationsnetwork types 613. For example, multiple network interfaces may beemployed to allow for the communication over broadcast, multicast,and/or unicast networks.

Input Output interfaces (I/O) 608 may accept, communicate, and/orconnect to user input devices 611, peripheral devices 612, cryptographicprocessor devices 628, and/or the like. I/O may employ connectionprotocols such as, but not limited to: Apple Desktop Bus (ADB); AppleDesktop Connector (ADC); audio: analog, digital, monaural, RCA, stereo,and/or the like; IEEE 1394a-b; infrared; joystick; keyboard; midi;optical; PC AT; PS/2; parallel; radio; serial; USB; video interface:BNC, coaxial, composite, digital, Digital Visual Interface (DVI), RCA,RF antennae, S-Video, VGA, and/or the like; wireless; and/or the like. Acommon output device is a television set 145, which accepts signals froma video interface. Also, a video display, which typically comprises aCathode Ray Tube (CRT) or Liquid Crystal Display (LCD) based monitorwith an interface (e.g., DVI circuitry and cable) that accepts signalsfrom a video interface, may be used. The video interface compositesinformation generated by a computer systemization and generates videosignals based on the composited information in a video memory frame.Typically, the video interface provides the composited video informationthrough a video connection interface that accepts a video displayinterface (e.g., an RCA composite video connector accepting an RCAcomposite video cable; a DVI connector accepting a DVI display cable,etc.).

User input devices 611 may be card readers, dongles, finger printreaders, gloves, graphics tablets, joysticks, keyboards, mouse (mice),remote controls, retina readers, trackballs, trackpads, and/or the like.

Peripheral devices 612 may be connected and/or communicate to I/O and/orother facilities of the like such as network interfaces, storageinterfaces, and/or the like. Peripheral devices may be audio devices,cameras, dongles (e.g., for copy protection, ensuring securetransactions with a digital signature, and/or the like), externalprocessors (for added functionality), goggles, microphones, monitors,network interfaces, printers, scanners, storage devices, video devices,video sources, visors, and/or the like.

It should be noted that although user input devices and peripheraldevices may be employed, the time based search host 601 may be embodiedas an embedded, dedicated, and/or monitor-less (i.e., headless) device,wherein access would be provided over a network interface connection.

Cryptographic units such as, but not limited to, microcontrollers,processors 626, interfaces 627, and/or devices 628 may be attached,and/or communicate with time based search host controller. A MC68HC16microcontroller, commonly manufactured by Motorola Inc., may be used forand/or within cryptographic units. Equivalent microcontrollers and/orprocessors may also be used. The MC68HC16 microcontroller utilizes a16-bit multiply-and-accumulate instruction in the 16 MHz configurationand requires less than one second to perform a 512-bit RSA private keyoperation. Cryptographic units support the authentication ofcommunications from interacting agents, as well as allowing foranonymous transactions. Cryptographic units may also be configured aspart of CPU. Other commercially available specialized cryptographicprocessors include VLSI Technology's 33 MHz 6868 or SemaphoreCommunications' 40 MHz Roadrunner 184.

Memory

Generally, any mechanization and/or embodiment allowing a processor toaffect the storage and/or retrieval of information is regarded as memory629. However, memory is a fungible technology and resource, thus, anynumber of memory embodiments may be employed in lieu of or in concertwith one another. It is to be understood that a the time based searchhost controller and/or a computer systemization may employ various formsof memory 629. For example, a computer systemization may be configuredwherein the functionality of on-chip CPU memory (e.g., registers), RAM,ROM, and any other storage devices are provided by a paper punch tape orpaper punch card mechanism; of course such an embodiment would result inan extremely slow rate of operation. In a typical configuration, memory629 will include ROM 606, RAM 605, and a storage device 614. A storagedevice 614 may be any conventional computer system storage. Storagedevices may include a drum; a (fixed and/or removable) magnetic diskdrive; a magneto-optical drive; an optical drive (i.e., CDROM/RAM/Recordable (R), ReWritable (RW), DVD R/RW, etc.); and/or otherdevices of the like. Thus, a computer systemization generally requiresand makes use of memory.

Module Collection

The memory 629 may contain a collection of program and/or databasemodules and/or data such as, but not limited to: operating systemmodule(s) 615 (operating system); information server module(s) 616(information server); user interface module(s) 617 (user interface); Webbrowser module(s) 618 (Web browser); database(s) 619; cryptographicserver module(s) 620 (cryptographic server); the time based searchinterface module(s) 635; and/or the like (i.e., collectively a modulecollection). These modules may be stored and accessed from the storagedevices and/or from storage devices accessible through an interface bus.Although non-conventional software modules such as those in the modulecollection, typically, are stored in a local storage device 614, theymay also be loaded and/or stored in memory such as: peripheral devices,RAM, remote storage facilities through a communications network, ROM,various forms of memory, and/or the like.

Operating System

The operating system module 615 is executable program code facilitatingthe operation of the time based search host controller. Typically, theoperating system facilitates access of I/O, network interfaces,peripheral devices, storage devices, and/or the like. The operatingsystem may be a highly fault tolerant, scalable, and secure system suchas Apple Macintosh OS X (Server), AT&T Plan 9, Be OS, Linux, Unix,and/or the like operating systems. However, more limited and/or lesssecure operating systems also may be employed such as Apple MacintoshOS, Microsoft DOS, Palm OS, Windows2000/2003/3.1/95/98/CE/Millenium/NT/XP (Server), and/or the like.Basically, any current or future network connected operating systemcould also fulfill this role. An operating system may communicate toand/or with other modules in a module collection, including itself,and/or the like. Most frequently, the operating system communicates withother program modules, user interfaces, and/or the like. For example,the operating system may contain, communicate, generate, obtain, and/orprovide program module, system, user, and/or data communications,requests, and/or responses. The operating system, once executed by theCPU, may enable the interaction with communications networks, data, I/O,peripheral devices, program modules, memory, user input devices, and/orthe like. The operating system may provide communications protocols thatallow the time based search host controller to communicate with otherentities through a communications network 613. Various communicationprotocols may be used by the time based search host 601 as a subcarriertransport mechanism for interaction, such as, but not limited to:multicast, TCP/IP, UDP, unicast, and/or the like.

Information Server

An information server module 616 is stored program code that is executedby the CPU. The information server may be a conventional Internetinformation server such as, but not limited to Apache SoftwareFoundation's Apache, Microsoft's Internet Information Server, and/or theinformation server may allow for the execution of program modulesthrough facilities such as Active Server Page (ASP), ActiveX, (ANSI)(Objective-) C (++), C#, Common Gateway Interface (CGI) scripts, Java,JavaScript, Practical Extraction Report Language (PERL), Python,WebObjects, and/or the like. The information server may support securecommunications protocols such as, but not limited to, File TransferProtocol (FTP); HyperText Transfer Protocol (HTTP); Secure HypertextTransfer Protocol (HTTPS), Secure Socket Layer (SSL), and/or the like.The information server provides results in the form of Web pages to Webbrowsers, and allows for the manipulated generation of the Web pagesthrough interaction with other program modules. After a Domain NameSystem (DNS) resolution portion of an HTTP request is resolved to aparticular information server, the information server resolves requestsfor information at specified locations on the time based search hostcontroller based on the remainder of the HTTP request. For example, arequest such as http://123.124.125.126/myInformation.html might have theIP portion of the request “123.124.125.126” resolved by a DNS server toan information server at that IP address; that information server mightin turn further parse the http request for the “imyInformation.html”portion of the request and resolve it to a location in memory containingthe information “myInformation.html.” Additionally, other informationserving protocols may be employed across various ports, e.g., FTPcommunications across port 21, and/or the like. An information servermay communicate to and/or with other modules in a module collection,including itself, and/or facilities of the like. Most frequently, theinformation server communicates with the time based search host database619, operating systems, other program modules, user interfaces, Webbrowsers, and/or the like.

Access to the time based search host database may be achieved through anumber of database bridge mechanisms such as through scripting languagesas enumerated below (e.g., CGI) and through inter-applicationcommunication channels as enumerated below (e.g., CORBA, WebObjects,etc.). Any data requests through a Web browser are parsed through thebridge mechanism into appropriate grammars as required by the time basedsearch host. In one embodiment, the information server would provide aWeb form accessible by a Web browser. Entries made into supplied fieldsin the Web form are tagged as having been entered into the particularfields, and parsed as such. The entered terms are then passed along withthe field tags, which act to instruct the parser to generate queriesdirected to appropriate tables and/or fields. In one embodiment, theparser may generate queries in standard SQL by instantiating a searchstring with the proper join/select commands based on the tagged textentries, wherein the resulting command is provided over the bridgemechanism to the time based search host as a query. Upon generatingquery results from the query, the results are passed over the bridgemechanism, and may be parsed for formatting and generation of a newresults Web page by the bridge mechanism. Such a new results Web page isthen provided to the information server, which may supply it to therequesting Web browser.

Also, an information server may contain, communicate, generate, obtain,and/or provide program module, system, user, and/or data communications,requests, and/or responses.

User Interface

The function of computer interfaces in some respects is similar toautomobile operation interfaces. Automobile operation interface elementssuch as steering wheels, gearshifts, and speedometers facilitate theaccess, operation, and display of automobile resources, functionality,and status. Computer interaction interface elements such as check boxes,cursors, menus, scrollers, and windows (collectively and commonlyreferred to as widgets) similarly facilitate the access, operation, anddisplay of data and computer hardware and operating system resources,functionality, and status. Operation interfaces are commonly called userinterfaces. Graphical user interfaces (GUIs) such as the Apple MacintoshOperating System's Aqua, Microsoft's Windows XP, or Unix's X-Windowsprovide a baseline and means of accessing and displaying informationgraphically to users.

A user interface module 617 is stored program code that is executed bythe CPU. The user interface may be a conventional graphic user interfaceas provided by, with, and/or atop operating systems and/or operatingenvironments such as Apple Macintosh OS, e.g., Aqua, Microsoft Windows(NT/XP), Unix X Windows (KDE, Gnome, and/or the like), mythTV, and/orthe like. The user interface may allow for the display, execution,interaction, manipulation, and/or operation of program modules and/orsystem facilities through textual and/or graphical facilities. The userinterface provides a facility through which users may affect, interact,and/or operate a computer system. A user interface may communicate toand/or with other modules in a module collection, including itself,and/or facilities of the like. Most frequently, the user interfacecommunicates with operating systems, other program modules, and/or thelike. The user interface may contain, communicate, generate, obtain,and/or provide program module, system, user, and/or data communications,requests, and/or responses.

Web Browser

A Web browser module 618 is stored program code that is executed by theCPU. The Web browser may be a conventional hypertext viewing applicationsuch as Microsoft Internet Explorer or Netscape Navigator. Secure Webbrowsing may be supplied with 128 bit (or greater) encryption by way ofHTTPS, SSL, and/or the like. Some Web browsers allow for the executionof program modules through facilities such as Java, JavaScript, ActiveX,and/or the like. Web browsers and like information access tools may beintegrated into PDAs, cellular telephones, and/or other mobile devices.A Web browser may communicate to and/or with other modules in a modulecollection, including itself, and/or facilities of the like. Mostfrequently, the Web browser communicates with information servers,operating systems, integrated program modules (e.g., plug-ins), and/orthe like; e.g., it may contain, communicate, generate, obtain, and/orprovide program module, system, user, and/or data communications,requests, and/or responses. Of course, in place of a Web browser andinformation server, a combined application may be developed to performsimilar functions of both. The combined application would similarlyaffect the obtaining and the provision of information to users, useragents, and/or the like from the time based search enabled nodes. Thecombined application may be nugatory on systems employing standard Webbrowsers.

Cryptographic Server

A cryptographic server module 620 is stored program code that isexecuted by the CPU 603, cryptographic processor 626, cryptographicprocessor interface 627, cryptographic processor device 628, and/or thelike. Cryptographic processor interfaces will allow for expedition ofencryption and/or decryption requests by the cryptographic module;however, the cryptographic module, alternatively, may run on aconventional CPU. The cryptographic module allows for the encryptionand/or decryption of provided data. The cryptographic module allows forboth symmetric and asymmetric (e.g., Pretty Good Protection (PGP))encryption and/or decryption. The cryptographic module may employcryptographic techniques such as, but not limited to: digitalcertificates (e.g., X.509 authentication framework), digital signatures,dual signatures, enveloping, password access protection, public keymanagement, and/or the like. The cryptographic module will facilitatenumerous (encryption and/or decryption) security protocols such as, butnot limited to: checksum, Data Encryption Standard (DES), EllipticalCurve Encryption (ECC), International Data Encryption Algorithm (IDEA),Message Digest 5 (MD5, which is a one way hash function), passwords,Rivest Cipher (RC5), Rijndael, RSA (which is an Internet encryption andauthentication system that uses an algorithm developed in 1977 by RonRivest, Adi Shamir, and Leonard Adleman), Secure Hash Algorithm (SHA),Secure Socket Layer (SSL), Secure Hypertext Transfer Protocol (HTTPS),and/or the like. Employing such encryption security protocols, the timebased search host may encrypt all incoming and/or outgoingcommunications and may serve as node within a virtual private network(VPN) with a wider communications network. The cryptographic modulefacilitates the process of “security authorization” whereby access to aresource is inhibited by a security protocol wherein the cryptographicmodule effects authorized access to the secured resource. In addition,the cryptographic module may provide unique identifiers of content,e.g., employing and MD5 hash to obtain a unique signature for an digitalaudio file. A cryptographic module may communicate to and/or with othermodules in a module collection, including itself, and/or facilities ofthe like. The cryptographic module supports encryption schemes allowingfor the secure transmission of information across a communicationsnetwork to enable the time based search host module to engage in securetransactions if so desired. The cryptographic module facilitates thesecure accessing of resources on the time based search host andfacilitates the access of secured resources on remote systems; i.e., itmay act as a client and/or server of secured resources. Most frequently,the cryptographic module communicates with information servers,operating systems, other program modules, and/or the like. Thecryptographic module may contain, communicate, generate, obtain, and/orprovide program module, system, user, and/or data communications,requests, and/or responses.

The Time Based Search Host Database

The time based search host database module 619 may be embodied in adatabase and its stored data. The database is stored program code, whichis executed by the CPU; the stored program code portion configuring theCPU to process the stored data. The database may be a conventional,fault tolerant, relational, scalable, secure database such as Oracle orSybase. Relational databases are an extension of a flat file. Relationaldatabases consist of a series of related tables. The tables areinterconnected via a key field. Use of the key field allows thecombination of the tables by indexing against the key field; i.e., thekey fields act as dimensional pivot points for combining informationfrom various tables. Relationships generally identify links maintainedbetween tables by matching primary keys. Primary keys represent fieldsthat uniquely identify the rows of a table in a relational database.More precisely, they uniquely identify rows of a table on the “one” sideof a one-to-many relationship.

Alternatively, the time based search host database may be implementedusing various standard data-structures, such as an array, hash, (linked)list, struct, structured text file (e.g., XML), table, and/or the like.Such data-structures may be stored in memory and/or in (structured)files. In another alternative, an object-oriented database may be used,such as Frontier, ObjectStore, Poet, Zope, and/or the like. Objectdatabases can include a number of object collections that are groupedand/or linked together by common attributes; they may be related toother object collections by some common attributes. Object-orienteddatabases perform similarly to relational databases with the exceptionthat objects are not just pieces of data but may have other types offunctionality encapsulated within a given object. If the time basedsearch host database is implemented as a data-structure, the use of thetime based search host database 619 may be integrated into anothermodule such as the time based search host interface 635. Also, thedatabase may be implemented as a mix of data structures, objects, andrelational structures. Databases may be consolidated and/or distributedin countless variations through standard data processing techniques.Portions of databases, e.g., tables, may be exported and/or imported andthus decentralized and/or integrated.

The Time Based Search Host

The time based search host interface 635 is stored program code that isexecuted by the CPU. The time based search host affects accessing,obtaining and the provision of information, services, transactions,and/or the like across various communications networks.

The time based search host interface 635 enables access of informationbetween nodes may be developed by employing standard development toolssuch as, but not limited to: ANSI, Objective-C, C, C++, Apache modules,binary executables, database adapters, Java, JavaScript, mapping tools,procedural and object oriented development tools, PERL, Python, shellscripts, SQL commands, web application server extensions, WebObjects,and/or the like. In one embodiment, the time based search host serveremploys a cryptographic server to encrypt and decrypt communications.The time based search host module may communicate to and/or with othermodules in a module collection, including itself, and/or facilities ofthe like. Most frequently, the time based search host interface 635communicates with the time based search host database, operatingsystems, other program modules, and/or the like. The time based searchhost may contain, communicate, generate, obtain, and/or provide programmodule, system, user, and/or data communications, requests, and/orresponses.

Distributed Time Based Search Host

The structure and/or operation of any of the time based search hostcontroller components may be combined, consolidated, and/or distributedin any number of ways to facilitate development and/or deployment.Similarly, the module collection may be combined in any number of waysto facilitate deployment and/or development. To accomplish this, one mayintegrate the components into a common code base or in a facility thatcan dynamically load the components on demand in an integrated fashion.

The module collection may be consolidated and/or distributed incountless variations through standard data processing and/or developmenttechniques. Multiple instances of any one of the program modules in theprogram module collection may be instantiated on a single node, and/oracross numerous nodes to improve performance through load-balancingand/or data-processing techniques. Furthermore, single instances mayalso be distributed across multiple controllers and/or storage devices;e.g., databases. All program module instances and controllers working inconcert may do so through standard data processing communicationtechniques.

The configuration of the time based search host controller will dependon the context of system deployment. Factors such as, but not limitedto, the budget, capacity, location, and/or use of the underlyinghardware resources may affect deployment requirements and configuration.Regardless of if the configuration results in more consolidated and/orintegrated program modules, results in a more distributed series ofprogram modules, and/or results in some combination between aconsolidated and distributed configuration, data may be communicated,obtained, and/or provided. Instances of modules consolidated into acommon code base from the program module collection may communicate,obtain, and/or provide data. This may be accomplished throughintra-application data processing communication techniques such as, butnot limited to: data referencing (e.g., pointers), internal messaging,object instance variable communication, shared memory space, variablepassing, and/or the like.

If module collection components are discrete, separate, and/or externalto one another, then communicating, obtaining, and/or providing datawith and/or to other module components may be accomplished throughinter-application data processing communication techniques such as, butnot limited to: Application Program Interfaces (API) informationpassage; (distributed) Component Object Model ((D)COM), (Distributed)Object Linking and Embedding ((D)OLE), and/or the like), Common ObjectRequest Broker Architecture (CORBA), process pipes, shared files, and/orthe like. Messages sent between discrete module components forinter-application communication or within memory spaces of a singularmodule for intra-application communication may be facilitated throughthe creation and parsing of a grammar. A grammar may be developed byusing standard development tools such as lex, yacc, XML, and/or thelike, which allow for grammar generation and parsing functionality,which in turn may form the basis of communication messages within andbetween modules. Again, the configuration will depend upon the contextof system deployment.

The entirety of this disclosure (including the Cover Page, Title,Headings, Field, Background, Summary, Brief Description of the Drawings,Detailed Description, Claims, Abstract, Figures, and otherwise) shows byway of illustration various embodiments in which the claimed inventionsmay be practiced. The advantages and features of the disclosure are of arepresentative sample of embodiments only, and are not exhaustive and/orexclusive. They are presented only to assist in understanding and teachthe claimed principles. It should be understood that they are notrepresentative of all claimed inventions. As such, certain aspects ofthe disclosure have not been discussed herein. That alternateembodiments may not have been presented for a specific portion of theinvention or that further undescribed alternate embodiments may beavailable for a portion is not to be considered a disclaimer of thosealternate embodiments. It will be appreciated that many of thoseundescribed embodiments incorporate the same principles of the inventionand others are equivalent. Thus, it is to be understood that otherembodiments may be utilized and functional, logical, organizational,structural and/or topological modifications may be made withoutdeparting from the scope and/or spirit of the disclosure. As such, allexamples and/or embodiments are deemed to be non-limiting throughoutthis disclosure. Also, no inference should be drawn regarding thoseembodiments discussed herein relative to those not discussed hereinother than it is as such for purposes of reducing space and repetition.For instance, it is to be understood that the logical and/or topologicalstructure of any combination of any program modules (a modulecollection), other components and/or any present feature sets asdescribed in the figures and/or throughout are not limited to a fixedoperating order and/or arrangement, but rather, any disclosed order isexemplary and all equivalents, regardless of order, are contemplated bythe disclosure. Furthermore, it is to be understood that such featuresare not limited to serial execution, but rather, any number of threads,processes, services, servers, and/or the like that may executeasynchronously, concurrently, in parallel, simultaneously,synchronously, and/or the like are contemplated by the disclosure. Assuch, some of these features may be mutually contradictory, in that theycannot be simultaneously present in a single embodiment. Similarly, somefeatures are applicable to one aspect of the invention, and inapplicableto others. In addition, the disclosure includes other inventions notpresently claimed. Applicant reserves all rights in those presentlyunclaimed inventions including the right to claim such inventions, fileadditional applications, continuations, continuations in part,divisions, and/or the like thereof. As such, it should be understoodthat advantages, embodiments, examples, functional, features, logical,organizational, structural, topological, and/or other aspects of thedisclosure are not to be considered limitations on the disclosure asdefined by the claims or limitations on equivalents to the claims.

1. A method for identifying service providers available at one or morespecified future time(s) comprising: receiving a service provideridentifier from a first network location; receiving the serviceprovider's service type from the first network location; receiving theservice provider's physical location from the first network location;receiving future availability information relating to the serviceprovider from the first network location; storing and associating thereceived service provider indentifier, service type, physical location,and future availability information in a database; receiving a requestfor service provider identification comprising a requested futureavailability time(s) and a requested physical location from a secondnetwork location; searching the database for matches to the receivedrequest; and outputting information indicating the results of the searchto the second network location.
 2. A method for identifying serviceproviders available at one or more future time(s) comprising: storingfuture availability information relating to one or more serviceproviders; storing information describing one or more characteristics ofeach of the one or more service providers; associating the stored futureavailability information with the stored one or more characteristics foreach service provider; receiving a request for service provideridentification comprising a requested future time(s) availability and atleast one requested service provider characteristic; searching thestored future availability and associated service providercharacteristics for matches to the received request; and outputtinginformation indicating the results of the search.
 3. The method of claim2 wherein the one or more stored characteristics of the serviceproviders include the type of service provided by the one or moreservice providers.
 4. The method of claim 2 wherein the one or morestored characteristics of the service providers include the physicallocation of the one or more service providers.
 5. The method of claim 2wherein the one or more stored characteristics of the one or moreservice providers are comprised of the text web sites associated withthe one or more service providers.
 6. The method of claim 2 wherein thefuture availability information of the one or more service providers isstored in a machine-readable format.
 7. The method of claim 2 whereinthe future availability information of the one or more service providersis input by the service providers.
 8. The method of claim 6 wherein themachine-readable format is XML based.
 9. The method of claim 2 whereinthe future availability information of the one or more service providersis stored as plain text.
 10. The method of claim 2 wherein the requestedfuture time availability describes a range of potentially suitabletimes.
 11. The method of claim 2 wherein the requested future timeavailability describes a regular time interval.
 12. The method of claim2 wherein the requested future time availability describes a requestedfinish time by which the service provider must be finished.
 13. A methodfor identifying service providers available at one or more futuretime(s) comprising: storing future availability information relating toone or more service providers; storing information describing one ormore characteristics of each of the one or more service providers;associating the stored future availability information with the storedone or more characteristics for each service provider; providing a firstuser interface elements for entering an availability request for one ormore future time(s); providing a second user interface elements forentering a service provider characteristic; accepting input from thefirst and second user interface elements; searching the stored futureavailability and associated service provider characteristics for matchesto the accepted input; and providing a third user interface elementindicating the results of the search.
 14. The method of claim 13 whereinthe second user interface element comprises a list of available serviceprovider types.
 15. The method of claim 13 wherein the second userinterface element comprises a list of available service locations.
 16. Amethod for indicating future availability of traveling providerscomprising: receiving information from a traveling providers comprisingthe current location the traveling providers; receiving information fromthe traveling providers comprising the time availability of thetraveling providers; generating associated future availability and nextjob location information based on the time availability of the travelingproviders and the time needed to travel from the current location of thetraveling providers to a given next job location; and storing theassociated future availability and next job location information on anetwork accessible device, so as to provide data to a time based searchprovider.
 17. The method of claim 16 further comprising: notifying thetime based search provider of a change in the associated futureavailability.
 18. The method of claim 16 wherein the informationreceived from the traveling providers comprising the location of thetraveling providers is provided automatically via GPS.
 19. The method ofclaim 16 further comprising an RSS feed to notify the time based searchprovider of changes to the future availability information.
 20. A systemfor identifying service providers available at one or more futuretime(s) comprising: a processor; a memory connected to and incommunication with the processor and containing program instructions; anetwork interface connected to the processor to provide network accessto the processor; wherein the processor executes program instructionscontained in the memory and the program instruction comprise: storingfuture availability information relating to one or more serviceproviders; storing information describing one or more characteristics ofeach of the one or more service providers; associating the stored futureavailability information with the stored one or more characteristics foreach service provider; receiving a request for service provideridentification comprising a requested future time(s) availability and atleast one requested service provider characteristic; searching thestored future availability and associated service providercharacteristics for matches to the received request; and outputtinginformation indicating the results of the search.
 21. The system ofclaim 20 wherein the one or more stored characteristics of the serviceproviders include the type of service provided by the one or moreservice providers.
 22. The system of claim 20 wherein the one or morestored characteristics of the service providers include the physicallocation of the one or more service providers.
 23. The system of claim20 wherein the one or more stored characteristics of the one or moreservice providers are comprised of the text web sites associated withthe one or more service providers.
 24. The system of claim 20 whereinthe future availability information of the one or more service providersis stored in a machine-readable format.
 25. The system of claim 20wherein the future availability information of the one or more serviceproviders is input by the service providers.
 26. The system of claim 24wherein the machine-readable format is XML based.
 27. The system ofclaim 20 wherein the future availability information of the one or moreservice providers is stored as plain text.
 28. The system of claim 20wherein the requested future time availability describes a range ofpotentially suitable times.
 29. The system of claim 20 wherein therequested future time availability describes a regular time interval.30. The system of claim 20 wherein the requested future timeavailability describes a requested finish time by which the serviceprovider must be finished.
 31. A system for identifying serviceproviders available at one or more future time(s) comprising: aprocessor; a memory connected to and in communication with the processorand containing program instructions; a network interface connected tothe processor to provide network access to the processor; wherein theprocessor executes program instructions contained in the memory and theprogram instruction comprise: storing future availability informationrelating to one or more service providers; storing informationdescribing one or more characteristics of each of the one or moreservice providers; associating the stored future availabilityinformation with the stored one or more characteristics for each serviceprovider; providing a first user interface elements for entering anavailability request for one or more future time(s); providing a seconduser interface elements for entering a service provider characteristic;accepting input from the first and second user interface elements;searching the stored future availability and associated service providercharacteristics for matches to the accepted input; and providing a thirduser interface element indicating the results of the search.
 32. Thesystem of claim 31 wherein the second user interface element comprises alist of available service provider types.
 33. The system of claim 31wherein the second user interface element comprises a list of availableservice locations.
 34. A system for indicating future availability oftraveling providers comprising: a processor; a memory connected to andin communication with the processor and containing program instructions;a network interface connected to the processor to provide network accessto the processor; wherein the processor executes program instructionscontained in the memory and the program instruction comprise: receivinginformation from a traveling providers comprising the current locationthe traveling providers; receiving information from the travelingproviders comprising the time availability of the traveling providers;generating associated future availability and next job locationinformation based on the time availability of the traveling providersand the time needed to travel from the current location of the travelingproviders to a given next job location; and storing the associatedfuture availability and next job location information on a networkaccessible device, so as to provide data to a time based searchprovider.
 35. The system of claim 34 further comprising: notifying thetime based search provider of a change in the associated futureavailability.
 36. The system of claim 34 wherein the informationreceived from the traveling providers comprising the location of thetraveling providers is provided automatically via GPS.
 37. The system ofclaim 34 further comprising an RSS feed to notify the time based searchprovider of changes to the future availability information.
 38. Acomputer program product for identifying service providers available atone or more future time(s) comprising: a computer readable mediacontaining computer program logic comprising: program logic for storingfuture availability information relating to one or more serviceproviders; program logic for storing information describing one or morecharacteristics of each of the one or more service providers; programlogic for associating the stored future availability information withthe stored one or more characteristics for each service provider;program logic for receiving a request for service provideridentification comprising a requested future time(s) availability and atleast one requested service provider characteristic; program logic forsearching the stored future availability and associated service providercharacteristics for matches to the received request; and program logicfor outputting information indicating the results of the search.
 39. Theprogram product of claim 38 wherein the one or more storedcharacteristics of the service providers include the type of serviceprovided by the one or more service providers.
 40. The program productof claim 38 wherein the one or more stored characteristics of theservice providers include the physical location of the one or moreservice providers.
 41. The program product of claim 38 wherein the oneor more stored characteristics of the one or more service providers arecomprised of the text web sites associated with the one or more serviceproviders.
 42. The program product of claim 38 wherein the futureavailability information of the one or more service providers is storedin a machine-readable format.
 43. The program product of claim 38wherein the future availability information of the one or more serviceproviders is input by the service providers.
 44. The program product ofclaim 42 wherein the machine-readable format is XML based.
 45. Theprogram product of claim 38 wherein the future availability informationof the one or more service providers is stored as plain text.
 46. Theprogram product of claim 38 wherein the requested future timeavailability describes a range of potentially suitable times.
 47. Theprogram product of claim 38 wherein the requested future timeavailability describes a regular time interval.
 48. The program productof claim 38 wherein the requested future time availability describes arequested finish time by which the service provider must be finished.49. A program product for identifying service providers available at oneor more future time(s) comprising: a computer readable media containingcomputer program logic comprising: program logic for storing futureavailability information relating to one or more service providers;program logic for storing information describing one or morecharacteristics of each of the one or more service providers; programlogic for associating the stored future availability information withthe stored one or more characteristics for each service provider;program logic for providing a first user interface elements for enteringan availability request for one or more future time(s); program logicfor providing a second user interface elements for entering a serviceprovider characteristic; program logic for accepting input from thefirst and second user interface elements; program logic for searchingthe stored future availability and associated service providercharacteristics for matches to the accepted input; and program logic forproviding a third user interface element indicating the results of thesearch.
 50. The program product of claim 49 wherein the second userinterface element comprises a list of available service provider types.51. The program logic for of claim 49 wherein the second user interfaceelement comprises a list of available service locations.
 52. A programproduct indicating future availability of traveling providerscomprising: a processor; a computer readable media containing computerprogram logic comprising: program logic for receiving information from atraveling providers comprising the current location the travelingproviders; program logic for receiving information from the travelingproviders comprising the time availability of the traveling providers;program logic for generating associated future availability and next joblocation information based on the time availability of the travelingproviders and the time needed to travel from the current location of thetraveling providers to a given next job location; and program logic forstoring the associated future availability and next job locationinformation on a network accessible device, so as to provide data to atime based search provider.
 53. The program product of claim 52 furthercomprising: program logic for notifying the time based search providerof a change in the associated future availability.
 54. The programproduct of claim 52 wherein the information received from the travelingproviders comprising the location of the traveling providers is providedautomatically via GPS.
 55. The program product of claim 52 furthercomprising an RSS feed to notify the time based search provider ofchanges to the future availability information.